Group characters, permutation actions and sharpness
نویسندگان
چکیده
منابع مشابه
Group characters, permutation actions and sharpness
We extend the work which has appeared in papers on sharp characters and originated with Blichfeldt and Maillet to the Burnside ring of a finite group G. We show that the polynomial whose zeros are the set of marks of non-identity subgroups on a faithful G-set X evaluated at X is an integral multiple of the regular G-set, and deduce a result about the size of a base of X . Further consequences f...
متن کاملCounting characters in linear group actions
Let G be a finite group and V be a finite G–module. We present upper bounds for the cardinalities of certain subsets of Irr(GV ), such as the set of those χ ∈ Irr(GV ) such that, for a fixed v ∈ V , the restriction of χ to 〈v〉 is not a multiple of the regular character of 〈v〉. These results might be useful in attacking the non–coprime k(GV )–problem.
متن کاملIncidence Matrices, Permutation Characters, and the Minimal Genus of a Permutation Group
Corollary 1.2 Let G be an almost simple classical group with natural module V of dimension n. If G is linear, assume that G does not contain a graph automorphism. Let 2 ≤ k < n − 1, and let K be the stabilizer of a nondegenerate or totally singular k-space of V . Let P be the stabilizer of a singular 1-space of V . Then the permutation module 1P is a submodule of 1 G K unless one of the followi...
متن کاملReconstructing finite group actions and characters from subgroup information
Holroyd, F.C., Reconstructing finite group actions and characters from subgroup information, Discrete Mathematics 110 (1992) 283-287. A finite group G is said to be action reconstructible if, for any action of G on a finite set, the numbers of orbits under restriction to each subgroup always give enough information to reconstruct the action up to equivalence. G is character reconstructible if, ...
متن کاملFinding Possible Permutation Characters
We describe three different methods to compute all those characters of a finite group that have certain properties of transitive permutation characters. First, a combinatorial approach can be used to enumerate vectors of multiplicities. Secondly, these characters can be found as certain integral solutions of a system of inequalities. Thirdly, they are calculated via Gaussian elimination. The me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2003
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(02)00146-4